A sparse Prony FFT
نویسندگان
چکیده
We describe the application of Prony-like reconstruction methods to the problem of the sparse Fast Fourier transform (sFFT) [6]. In particular, we adapt both important parts of the sFFT, quasi random sampling and filtering techniques, to Prony-like methods.
منابع مشابه
Accuracy and computational comparisons of TLS - Prony , Burg , and FFT - basedscattering center extraction
Scattering centers extracted from radar returns are features that can be used for automatic target recognition (ATR). Many diierent algorithms exist which can extract scattering centers from a radar return. They all, however, fall into one of two large classes: model and FFT-based techniques. In this paper, we consider one FFT and two model based techniques: 1) FFT with peak extraction, 2) the ...
متن کاملInvestigations of Influence on Power Quality of Superconducting Fault Current Limiter
Waveforms obtained from a superconducting Fault Current Limiter are investigated using the Prony modelling technique. Comparable measurements with the use of standard tools of spectral analysis (like FFT) fail because of short data available and low levels of higher spectral components. Streszczenie. W pracy przedstawiono wyniki analizy widmowej prądów i napięć zarejestrowanych w obwodach z nad...
متن کاملParameter Estimation of Distorted Signals Using Prony Method
Modern frequency power converters generate a wide spectrum of harmonic components. Large converter systems can also generate noncharacteristic harmonics and interharmonics. Standard tools of harmonic analysis based on the Fourier transform assume that only harmonics are present and the periodicity intervals are fixed, while periodicity intervals in the presence of interharmonics are variable an...
متن کاملParameter estimation for nonincreasing exponential sums by Prony–like methods
Let zj := e fj with fj ∈ (−∞, 0] + i [−π, π) be distinct nodes for j = 1, . . . ,M . With complex coefficients cj 6= 0, we consider a nonincreasing exponential sum h(x) := c1 e f1 x + . . . + cM e fM x (x ≥ 0). Many applications in electrical engineering, signal processing, and mathematical physics lead to the following problem: Determine all parameters of h, if 2N sampled values h(k) (k = 0, ....
متن کاملAn Input-Adaptive Algorithm for High Performance Sparse Fast Fourier Transform
Many applications invoke the Fast Fourier Transform (FFT) on sparse inputs, with most of their Fourier coefficients being very small or equal to zero. Compared with the “dense” FFT algorithms, the input sparsity makes it easier to parallelize the sparse counterparts. In general, sparse FFT algorithms filter input into different frequency bins, and then process the bins separately. Clearly, the ...
متن کامل